Constraint Reasoning over Strings
نویسندگان
چکیده
This paper discusses an approach to representing and reasoning about constraints over strings. We discuss how many string domains can often be concisely represented using regular languages, and how constraints over strings, and domain operations on sets of strings, can be carried out using this representation.
منابع مشابه
Progressive Reasoning over Recursively-Defined Strings
We consider the problem of reasoning over an expressive constraint language for unbounded strings. The difficulty comes from “recursively defined” functions such as replace, making state-of-the-art algorithms non-terminating. Our first contribution is a progressive search algorithm to not only mitigate the problem of non-terminating reasoning but also guide the search towards a “minimal solutio...
متن کاملAn SMT-LIB Format for Sequences and Regular Expressions
Abstract Strings are ubiquitous in software. Tools for verification and testing of software rely in various degrees on reasoning about strings. Web applications are particularly important in this context since they tend to be string-heavy and have large number security errors attributable to improper string sanitzation and manipulations. In recent years, many string solvers have been implemente...
متن کاملMining association rules with multiple minimum supports using maximum constraints
Data mining is the process of extracting desirable knowledge or interesting patterns from existing databases for specific purposes. Most of the previous approaches set a single minimum support threshold for all the items or itemsets. But in real applications, different items may have different criteria to judge its importance. The support requirements should then vary with different items. In t...
متن کاملThe Complexity of Constraint Satisfaction Problems∗
The tractability conjecture for constraint satisfaction problems (CSPs) describes the constraint languages over a finite domain whose CSP can be solved in polynomial-time. The precise formulation of the conjecture uses basic notions from universal algebra. In this talk, we give a short introduction to the universal-algebraic approach to the study of the complexity of CSPs. Finally, we discuss a...
متن کاملA solver for a theory of strings ( in cooperation with mgm technology partners GmbH ) Motivation
We describe an algorithm for automatic test input generation fordatabase applications. Given a program in an imperative language that interactswith a database through API calls, our algorithm generates both input data for theprogram as well as suitable database records to systematically explore all paths of the program, including those paths whose execution depend on data returned<l...
متن کامل